Generalized Budan-Fourier theorem and virtual roots
نویسندگان
چکیده
The notion of virtual root was introduced in [5] in the case of polynomials. The virtual roots provide d continuous “root fonctions” on the space all real polynomials of a given degree d, with an interlacing property linking virtual roots of P and virtual roots of P ′. From a computational point of view, there is no need to know the coefficients with infinite precision in order to compute the virtual roots with finite precision: the discontinuity phenomenon of real roots vanishing in the complex plane “disappears”. Another nice fact is that all real roots of P are virtual roots and all virtual roots are real roots of P or of one of its derivatives. Theorem 2 of this note shows that the Budan-Fourier count always gives the number of virtual roots (with multiplicities) on an interval (a, b]. So the quantity by which the Budan-Fourier count exceeds the number of actual roots is explained by the presence of extra virtual roots.
منابع مشابه
Improved Budan-Fourier Count for Root Finding
Given a degree n univariate polynomial f(x), the Budan-Fourier function Vf (x) counts the sign changes in the sequence of derivatives of f evaluated at x. The values at which this function jumps are called the virtual roots of f , these include the real roots of f and any multiple root of its derivatives. This concept was introduced (by an equivalent property) by Gonzales-Vega, Lombardi, Mahé i...
متن کاملBudan tables of real univariate polynomials
The Budan table of f collects the signs of the iterated derivatives of f . We revisit the classical Budan-Fourier theorem for a univariate real polynomial f and establish a new connectivity property of its Budan table. We use this property to characterize the virtual roots of f (introduced by Gonzalez-Vega, Lombardi, Mahé in 1998); they are continuous functions of the coefficients of f . We als...
متن کاملExtension of the Fourier-Budan theorem to one-variable signomials
Let f(x) = a0x r0 + a1x r1 + · · · + akx rk , where each ai ∈ R, each rk ∈ N := {0, 1, . . . }, and r0 < r1 · · · < rk. Suppose u < v. Let z(f, u, v) = the number of roots of f in (u, v], counted with multiplicity. For any w ∈ R and n ∈ N, let s(f, w, n) = the number of sign-changes in the sequence f(w), f ′(w), f ′′(w), . . . , f (w) (skipping over zeros). Then the Fourier-Budan Theorem says t...
متن کاملAn Lp-Lq-version Of Morgan's Theorem For The Generalized Fourier Transform Associated with a Dunkl Type Operator
The aim of this paper is to prove new quantitative uncertainty principle for the generalized Fourier transform connected with a Dunkl type operator on the real line. More precisely we prove An Lp-Lq-version of Morgan's theorem.
متن کاملGENERALIZATION OF TITCHMARSH'S THEOREM FOR THE GENERALIZED FOURIER-BESSEL TRANSFORM
In this paper, using a generalized translation operator, we prove theestimates for the generalized Fourier-Bessel transform in the space L2 on certainclasses of functions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Complexity
دوره 21 شماره
صفحات -
تاریخ انتشار 2005